#include "Sort.h"

int main()
{
	//int nums[10] = { 9, 1, 2, 5, 7, 4, 8, 6, 3, 5 };
	//int nums[8] = { 2,4,1,7,8,3,9,2 };
	//int nums[8] = { 9, 1, 2, 5, 7, 4, 6, 3 };
	int nums[10] = { 10, 6, 7, 1, 3, 9, 4, 2, 5, 8 };
	//int nums[8] = { 10, 6, 7, 1, 3, 9, 4, 2 };

	//BubbleSort(nums, 10);
	
	//InsertSort(nums, 8);

	//ShellSort(nums, 8);

	//SelectSort(nums, 8);

	//HeapSort(nums, 8);

	//QuickSort(nums, 0, 9);

	//MergeSort(nums, 10);

	CountSort(nums, 10);

	return 0;
}